K. G. Milkaus žodyno rankraštinis perdirbinys

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knots with g(E(K)) = 2 and g(E(K#K#K)) = 6 and Morimoto’s Conjecture

We show that there exist knots K ⊂ S with g(E(K)) = 2 and g(E(K#K#K)) = 6. Together with [5, Theorem 1.5], this proves existence of counterexamples to Morimoto’s Conjecture [10]. This is a special case of [6]. Let Ki (i = 1, 2) be knots in the 3-sphere S, and let K1#K2 be their connected sum. We use the notation t(·), E(·), and g(·) to denote tunnel number, exterior, and Heegaard genus respecti...

متن کامل

$ast$-K-g-Frames in Hilbert $mathcal{A}$-modules

In this paper, we introduce the concepts of $ast$-K-g-Frames in Hilbert $mathcal{A}$-modules and we establish some results.

متن کامل

Freeform Surface Blends K . K . , G

12 Figure 8: Blending using two diierent magnitudes of T 2 i (t) = dC(t) dt n(u(t); v(t)). (a) (b) (c) Figure 9: Spout connection to the Utah teapot rounding using T 2 i (t) = dC(t) dt n(u(t); v(t)). 5 i (t) = (S u (u(t); v(t))r(t) + S v (u(t); v(t))s(t)). method, which is guaranteed to be perpendicular to the rail curves in Euclidean space. Figure 9 shows the original teapot (a), the lleted te...

متن کامل

Emergency Location Problems with an M/G/k Queueing System

  Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...

متن کامل

Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline

In this paper, we propose an ordinal optimization theory based algorithm to solve the optimization problem of G/G/1/K polling system with k-limited service discipline for a good enough solution using limited computation time. We assume that the arrival rates do not deteriorate visibly within a very short period. Our approach consists of two stages. In the first stage, we employ a typical geneti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Baltistica

سال: 2011

ISSN: 2345-0045,0132-6503

DOI: 10.15388/baltistica.22.1.2000